Large Immersions in Graphs with Independence Number 3 and 4
نویسندگان
چکیده
منابع مشابه
Large minors in graphs with given independence number
Aweakening of Hadwiger’s conjecture states that every n-vertex graphwith independence number α has a clique minor of size at least n α . Extending ideas of Fox (2010) [6], we prove that such a graph has a clique minor with at least n (2−c)α vertices where c > 1/19.2. © 2011 Elsevier B.V. All rights reserved.
متن کاملThe Independence Number of Graphs with Large Odd Girth
Let G be an r-regular graph of order n and independence number α(G). We show that if G has odd girth 2k + 3 then α(G) ≥ n1−1/kr1/k . We also prove similar results for graphs which are not regular. Using these results we improve on the lower bound of Monien and Speckenmeyer, for the independence number of a graph of order n and odd girth 2k + 3. AMS Subject Classification. 05C15 §
متن کاملThe Independence Number of Dense Graphs with Large Odd Girth
Let G be a graph with n vertices and odd girth 2k+3. Let the degree of a vertex v of G be d1(v). Let (G) be the independence number of G. Then we show (G) 2 ( k 1 k ) "X v2G d1(v) 1 k 1 #(k 1)=k . This improves and simpli es results proven by Denley [1]. AMS Subject Classi cation. 05C35 Let G be a graph with n vertices and odd girth 2k + 3. Let di(v) be the number of points of degree i from a v...
متن کاملOhba’s Conjecture is True for Graphs with Independence Number 3
Ohba’s conjecture states that if a graph G has chromatic number χ(G) = k and has at most 2k+1 vertices, then G has choice number Ch(G) equal to χ(G). We prove that Ohba’s conjecture is true for each graph that has independence number 3. We also prove that Ohba’s conjecture is true for each graph G that has an independent set S of size 4 such that G\S has independence number 3.
متن کاملOn the Independence Number of Graphs with Maximum Degree 3
Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs shown in Figure 1 as a subgraph. We prove that the independence number of G is at least n(G)/3 + nt(G)/42, where n(G) is the number of vertices in G and nt(G) is the number of nontriangle vertices in G. This bound is tight as implied by the wellknown tight lower bound of 5n(G)/14 on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.020